Szeged logisztikai környezete

PI, Szeged and Edge Szeged Polynomials of a Dendrimer Nanostar

Let G be a graph with vertex and edge sets V(G) and E(G), respectively. As usual, the distance between the vertices u and v of a connected graph G is denoted by d(u,v) and it is defined as the number of edges in a minimal path connecting the vertices u and v. Throughout the paper, a graph means undirected connected graph without loops and multiple edges. In chemical graph theory, a molecular gr...

PI, Szeged and Revised Szeged Indices of IPR Fullerenes

In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.

The Szeged Treebank Project

The major aim of the Szeged Treebank project was to create a high-quality database of syntactic structures for Hungarian that can serve as a golden standard to further research in linguistics and computational language processing. The treebank currently contains full syntactic parsing of about 82,000 sentences (1.2 million words), which is the result of accurate manual annotation. Inspired by t...

University of Szeged

The Szeged Treebank

The major aim of the Szeged Treebank project was to create a high-quality database of syntactic structures for Hungarian that can serve as a golden standard to further research in linguistics and computational language processing. The treebank currently contains full syntactic parsing of about 82,000 sentences, which is the result of accurate manual annotation. Current paper describes the lingu...